On O-Minimal Hybrid Systems
نویسندگان
چکیده
This paper is driven by a general motto: bisimulate an hybrid system by a finite symbolic dynamical system. In the case of ominimal hybrid systems, the continuous and discrete components can be decoupled, and hence, the problem reduces in building a finite symbolic dynamical system for the continuous dynamics of each location. We show that this can be done for a quite general class of hybrid systems defined on o-minimal structures. In particular, we recover the main result of a paper by Lafferriere G., Pappas G.J. and Sastry S. on o-minimal hybrid systems. Mathematics Subject Classification : 68Q60, 03C64.
منابع مشابه
O-Minimal Hybrid Systems
A uni ed approach to decidability questions for veri cation algorithms of hybrid systems is obtained by the construction of a bisimulation. Bisimulations are nite state quotients whose reachability properties are equivalent to those of the original in nite state hybrid system. In this paper, we introduce the notion of o-minimal hybrid systems, which are initialized hybrid systems whose relevant...
متن کاملOn the expressiveness and decidability of o-minimal hybrid systems
This paper is driven by a general motto: bisimulate a hybrid system by a finite symbolic dynamical system. In the case of o-minimal hybrid systems, the continuous and discrete components can be decoupled, and hence, the problem reduces in building a finite symbolic dynamical system for the continuous dynamics of each location. We show that this can be done for a quite general class of hybrid sy...
متن کاملA note on the undecidability of the reachability problem for o-minimal dynamical systems
Nowadays transition systems are universally recognised as a mathematical model of real life systems. A major question in the study of transitions systems is to know whether a system can reach some set of final states (from an initial set of states). This question is known as the reachability problem. It is natural to classify transition systems into subclasses depending on whether the reachabil...
متن کاملDiscrete Bounded Bisimulation on Hybrid Automata
Hybrid automata are the prevailing formalisms to reason about systems that consist of discrete and continuous functions. Several specializations like o-minimal hybrid automata have been considered that should (1) retain as much expressibility as possible, and (2) lead to decidable (reachability) problems. However, the discrete transitions of o-minimal automata require constant resets of the con...
متن کاملWeighted o-minimal hybrid systems
We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL ...
متن کامل